|
|
Image registration of ultrasound sequences using evolutionary algorithms
Hnízdilová, Bohdana ; Odstrčilík, Jan (referee) ; Mézl, Martin (advisor)
This master´s thesis deals with the registration of ultrasound sequences using evolutionary algorithms. The theoretical part of the thesis describes the process of image registration and its optimalization using genetic and metaheuristic algorithms. The thesis also presents problems that may occur during the registration of ultrasonographic images and various approaches to their registration. In the practical part of the work, several optimization methods for the registration of a number of sequences were implemented and compared.
|
|
|
Solution of Continuous Systems by Evolutionary Computational Techniques
Lang, Stanislav ; Šeda, Miloš (referee) ; Olehla, Miroslav (referee) ; Matoušek, Radomil (advisor)
The thesis deals the issue of solution of continuous systems by evolutionary computational techniques. Evolutionary computing techniques fall into the field of softcomputing, an advanced metaheuristics optimization that is becoming more and more a method of solving complicated optimization problems with the gradual increase in computing performance of computers. The solution of continuous systems, or the synthesis of continuous control circuits, is one of the areas where these advanced algorithms find their application. When dealing with continuous systems we will focus on regulatory issues. Evolutionary computing can then become a tool not only for optimization of controller parameters but also to design its structure. Various algorithms (genetic algorithm, differential evolution, etc.) can be used to optimize the parameters of the controller, for the design of the controller structurewe usually encounter so called grammatical evolution. However, the use of grammatical evolution is not necessary if appropriate coding is used, as suggested in the presented thesis. The thesis presents a method of designing the structure and parameters of a general linear controller using the genetic algorithm. A general linear regulator is known also as so called polynomial controller, if we encounter the polynomial theory of control. The method of encoding the description of the general linear controller into the genetic chain is crucial, it determines a set of algorithms that are usable for optimization and influence the efficiency of the calculations. Described coding, effective EVT implementation, including multi-criteria optimization, is a key benefit of this work.
|
|
|
Algorithms for Computerized Optimization of Logistic Combinatorial Problems
Bokiš, Daniel ; Peringer, Petr (referee) ; Hrubý, Martin (advisor)
This thesis deals with optimization problems with main focus on logistic Vehicle Routing Problem (VRP). In the first part term optimization is established and most important optimization problems are presented. Next section deals with methods, which are capable of solving those problems. Furthermore it is explored how to apply those methods to specific VRP, along with presenting some enhancement of those algorithms. This thesis also introduces learning method capable of using knowledge of previous solutions. At the end of the paper, experiments are performed to tune the parameters of used algorithms and to discuss benefit of suggested improvements.
|
|
|
Aerofoil Aerodynamic Features Optimization
Müller, Jan ; Rozehnal,, Dalibor (referee) ; Popela, Robert (referee) ; Zelinka, Ivan (referee) ; Ošmera, Pavel (advisor)
The content of the presented thesis is advanced optimization of the aerofoil wing of a general aircraft. Advanced metaheuristic optimization techniques based on evolutionary calculations and swarm algorithms are used for optimization. These algorithms are characterized by robustness of optimization and engineered degree of convergence and optimality of the solution. Within the solution, fundamental modifications of the original aerofoil optimizations were designed and implemented. A new variant of aerofoil evolutionary algorithms (aEA) was created from the original evolutionary algorithm (EA), followed by a new variant of aerofoil particle swarm optimization (aPSO) developed from the original particle swarm optimization (PSO). Then the hybridization of the mentioned methods was created in a parallel variant. The Bezier-PARSEC 3434 parameterization model that generates the aerofoil shape was used for the optimization process. A parametric model based on B-Spline was used to optimize the original aerofoil. Fluid dynamics simulation for the calculation of basic aerodynamic features (lift, drag, moment) was realized by Xfoil software. The results are then verified using fluid dynamics simulation (CFD ANSYS Fluent). From the point of view of optimization tasks developed by optimization and implementation, it is clear that this is a complex interdisciplinary task, the results of which are presented in this thesis.
|
|
|
Aerofoil Aerodynamic Features Optimization
Müller, Jan ; Popela, Robert (referee) ; Zelinka, Ivan (referee) ; Rozehnal,, Dalibor (referee) ; Ošmera, Pavel (advisor)
The content of the presented thesis is advanced optimization of the aerofoil wing of a general aircraft. Advanced metaheuristic optimization techniques based on evolutionary calculations and swarm algorithms are used for optimization. These algorithms are characterized by robustness of optimization and engineered degree of convergence and optimality of the solution. Within the solution, fundamental modifications of the original aerofoil optimizations were designed and implemented. A new variant of aerofoil evolutionary algorithms (aEA) was created from the original evolutionary algorithm (EA), followed by a new variant of aerofoil particle swarm optimization (aPSO) developed from the original particle swarm optimization (PSO). Then the hybridization of the mentioned methods was created in a parallel variant. The Bezier-PARSEC 3434 parameterization model that generates the aerofoil shape was used for the optimization process. A parametric model based on B-Spline was used to optimize the original aerofoil. Fluid dynamics simulation for the calculation of basic aerodynamic features (lift, drag, moment) was realized by Xfoil software. The results are then verified using fluid dynamics simulation (CFD ANSYS Fluent). From the point of view of optimization tasks developed by optimization and implementation, it is clear that this is a complex interdisciplinary task, the results of which are presented in this thesis.
|
|
|
Image registration of ultrasound sequences using evolutionary algorithms
Hnízdilová, Bohdana ; Odstrčilík, Jan (referee) ; Mézl, Martin (advisor)
This master´s thesis deals with the registration of ultrasound sequences using evolutionary algorithms. The theoretical part of the thesis describes the process of image registration and its optimalization using genetic and metaheuristic algorithms. The thesis also presents problems that may occur during the registration of ultrasonographic images and various approaches to their registration. In the practical part of the work, several optimization methods for the registration of a number of sequences were implemented and compared.
|
|
|
Solution of Continuous Systems by Evolutionary Computational Techniques
Lang, Stanislav ; Šeda, Miloš (referee) ; Olehla, Miroslav (referee) ; Matoušek, Radomil (advisor)
The thesis deals the issue of solution of continuous systems by evolutionary computational techniques. Evolutionary computing techniques fall into the field of softcomputing, an advanced metaheuristics optimization that is becoming more and more a method of solving complicated optimization problems with the gradual increase in computing performance of computers. The solution of continuous systems, or the synthesis of continuous control circuits, is one of the areas where these advanced algorithms find their application. When dealing with continuous systems we will focus on regulatory issues. Evolutionary computing can then become a tool not only for optimization of controller parameters but also to design its structure. Various algorithms (genetic algorithm, differential evolution, etc.) can be used to optimize the parameters of the controller, for the design of the controller structurewe usually encounter so called grammatical evolution. However, the use of grammatical evolution is not necessary if appropriate coding is used, as suggested in the presented thesis. The thesis presents a method of designing the structure and parameters of a general linear controller using the genetic algorithm. A general linear regulator is known also as so called polynomial controller, if we encounter the polynomial theory of control. The method of encoding the description of the general linear controller into the genetic chain is crucial, it determines a set of algorithms that are usable for optimization and influence the efficiency of the calculations. Described coding, effective EVT implementation, including multi-criteria optimization, is a key benefit of this work.
|
|
|
Algorithms for Computerized Optimization of Logistic Combinatorial Problems
Bokiš, Daniel ; Peringer, Petr (referee) ; Hrubý, Martin (advisor)
This thesis deals with optimization problems with main focus on logistic Vehicle Routing Problem (VRP). In the first part term optimization is established and most important optimization problems are presented. Next section deals with methods, which are capable of solving those problems. Furthermore it is explored how to apply those methods to specific VRP, along with presenting some enhancement of those algorithms. This thesis also introduces learning method capable of using knowledge of previous solutions. At the end of the paper, experiments are performed to tune the parameters of used algorithms and to discuss benefit of suggested improvements.
|
|
|
Rozvozní úloha s dělenou dodávkou - heuristické metody
Mertl, Jakub ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
V předložené práci studujeme rozvozní úlohy. V první části je pojednáno o různých typech rozvozních úloh. Druhá část obsahuje popis heuristik a metaheuristik. Dále se zaměříme na rozvozní úlohu s dělenou dodávkou. Cílem práce je naprogramování heuristiky nebo metaheuristiky pro tento typ úlohy. Závěr obsahuje výsledky praktické části a shrnutí důležitých vlastností.
|
|
|
Heuristic Methods for General Routing Problems
Muchna, Jan ; Fábry, Jan (advisor) ; Šindelářová, Irena (referee)
The purpose of this work is an analysis of the current state of heuristic methods and their evaluation based on following attributes: accuracy, speed and quality of coding. The work is divided into 3 sections: an introduction to the general routing problem, methods of evaluations and describtion of tangible heuristics and metaheuristics methods. Following algorithms are depicted - from classical heuristics: Clarke and Wright algorithm, Sweep algorithm, Fisher-Jaikumar algorithm, Repeated matching algorithm, Location based heuristics and Petal heuristics - from metaheuristcs: General methods based on Tabu search, Taburoute algorithm, Adaptive memory method. Particular focus of the work is given to Repeated matching algorithm.
|
guest ::
